A Dynamically Reconfigurable Processor for Dataflow Graph Execution

نویسنده

  • Lorenzo Verdoscia
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modeling method for Reconfigurable Processor Performance Analysis

Coarse grained reconfigurable architecture (CGRA) has become an important solution for high performance computing because of its high speed up ratio for computation intensive applications, fast configuration, good adaptability and low power consumption. However, the traditional performance analysis method of register transfer level modeling is simulating, which is still widely used. To overcome...

متن کامل

Accelerating control-flow intensive code in spatial hardware

Designers are increasingly utilizing spatial (e.g. custom and reconfigurable) architectures to improve both efficiency and performance in increasingly heterogeneous systems-onchip. Unfortunately, while such architectures can provide orders of magnitude better efficiency and performance on numeric applications, they exhibit poor performance when implementing sequential, control-flow intensive co...

متن کامل

Black-Diamond: a Retargetable Compiler using Graph with Configuration Bits for Dynamically Reconfigurable Architectures

For developing design envionment for various types of Dynamically Reconfigurable Processor Arrays (DRPAs), the GCI (Graph with Configuration Information) is proposed to represent configurable resource in the target dynamically reconfigurable architecture. The function unit, constant unit, register, and routing resource can be represented in the graph as well as the configuration information. Th...

متن کامل

Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

This paper proposes a new replica placement algorithm that expands the exhaustive search limit with reasonable calculation time. It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN). It is derived from the set cover p...

متن کامل

Kernel Formation in Garpcc

The Garp project [3] quantitatively investigates the benefits of adding an on-chip dynamically reconfigurable coprocessor to a standard instruction processor. Intended for acceleration of loops, Garp’s coprocessor performs iteration control and both streaming and random memory accesses without assistance from the instruction processor. The companion project Garpcc [2] investigates whether new c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002